$ax \equiv b \left( \bmod n \right)$
Enter number $a$:
Enter number $b$:
Enter number $n$:
Solve $ax \equiv b \left( \bmod n \right)$